Solution: In a binary tree, a node can have atmost 2 nodes (i.e.) 0,1 or 2 left and right child.

Solution: A binary tree is a rooted tree and also an ordered tree (i.e) every node in a binary tree has at most two children.

Solution: Three common operations are performed in a binary tree- they are insertion, deletion and traversal.

Solution: Breadth first traversal, also known as level order traversal is the traversal strategy used in a binary tree. It involves visiting all the nodes at a given level.

Solution: Two kinds of insertion operation is performed in a binary tree- inserting a leaf node and inserting an internal node.

Solution: A succinct binary tree occupies close to minimum possible space established by lower bounds. A succinct binary tree would occupy 2n+O(n) bits.

Solution: The average depth of a binary tree is given as O(√N). In case of a binary search tree, it is O(log N).

Solution: If binary trees are represented in arrays, left children are located at indices 2i+1 and right children at 2i+2.

Solution: If a binary tree is represented in an array, parent nodes are found at indices (i-1)/2.

Solution: In preorder, inorder and postorder traversal the left subtrees are visited before the right subtrees. In Inorder traversal, the Left subtree is visited first then the Root node then the Right subtree. In postorder traversal, the Left subtree is visited first, then Right subtree and then the Root node is visited.